Introducing Nominals to the Combined Query Answering Approaches for EL
نویسندگان
چکیده
So-called combined approaches answer a conjunctive query over a description logic ontology in three steps: first, they materialise certain consequences of the ontology and the data; second, they evaluate the query over the data; and third, they filter the result of the second phase to eliminate unsound answers. Such approaches were developed for various members of the DL-Lite and the EL families of languages, but none of them can handle ontologies containing nominals. In our work, we bridge this gap and present a combined query answering approach for ELHO ⊥—a logic that contains all features of the OWL 2 EL standard apart from transitive roles and complex role inclusions. This extension is nontrivial because nominals require equality reasoning, which introduces complexity into the first and the third step. Our empirical evaluation suggests that our technique is suitable for practical application, and so it provides a practical basis for conjunctive query answering in a large fragment of OWL 2 EL.
منابع مشابه
Evaluating conjunctive and graph queries over the EL profile of OWL 2
OWL 2 EL is a popular ontology language that is based on the EL family of description logics and supports regular role inclusions—axioms that can capture compositional properties of roles such as role transitivity and reflexivity. In this thesis, we present several novel complexity results and algorithms for answering expressive queries over OWL 2 EL knowledge bases (KBs) with regular role incl...
متن کاملThe Combined Complexity of Reasoning with Closed Predicates in Description Logics
We investigate the computational cost of combining the open and closed world assumptions in Description Logics. Unlike previous works, which have considered data complexity and focused mostly on lightweight DLs, we study combined complexity for a wide range of DLs, from lightweight to very expressive ones. From existing results for the standard setting, where all predicates are interpreted unde...
متن کاملExtending DL-Lite_A with (Singleton) Nominals
In this paper we study the extension of description logics of the DL-Lite family with singleton nominals, which correspond in OWL 2 to the ObjectHasValue construct. Differently from arbitrary (nonsingleton) nominals, which make query answering intractable in data complexity, we show that both knowledge base satisfiability and conjunctive query answering stay first-order rewritable when DL-LiteA...
متن کاملTowards Practical Query Answering for Horn-SHIQ
Query answering has become a prominent reasoning task in Description Logics. This is witnessed not only by the high number of publications on the topic in the last decade, but also by the increasing number of query answering engines. A number of systems provide full conjunctive query (CQ) answering capabilities, including [1, 23, 25, 4, 11]. A common feature of these approaches is that they rel...
متن کاملQuery Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ
The high computational complexity of the expressive Description Logics (DLs) that underlie the OWL standard has motivated the study of their Horn fragments, which are usually tractable in data complexity and can also have lower combined complexity, particularly for query answering. In this paper we provide algorithms for answering conjunctive 2-way regular path queries (2CRPQs), a nontrivial ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013